Control Flow Analysis for Recursion Removal
نویسندگان
چکیده
In this paper a new method for removing recursion from algorithms is demonstrated. The method for removing recursion is based on algebraic manipulations of a mathematical model of the control flow. The method is not intended to solve all possible recursion removal problems, but instead can be seen as one tool in a larger tool box of program transformations. Our method can handle certain types of recursion that are not easily handled by existing methods, but it may be overkill for certain types of recursion where existing methods can be applied, like tail-recursion. The motivation for a new method is discussed and it is illustrated on an MPEG4 visual texture decoding algorithm.
منابع مشابه
Exact Flow Analysis by Higher-Order Model Checking
We propose a novel control flow analysis for higher-order functional programs, based on a reduction to higher-order model checking. The distinguished features of our control flow analysis are that, unlike most of the control flow analyses like k-CFA, it is exact for simplytyped λ-calculus with recursion and finite base types, and that, unlike Mossin’s exact flow analysis, it is indeed runnable ...
متن کاملCalculation for Energy of (111) Surfaces of Palladium in Tight Binding Model
In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...
متن کاملPushdown Exception-Flow Analysis of Object-Oriented Programs
Statically reasoning in the presence of and about exceptions is challenging: exceptions worsen the well-known mutual recursion between data-flow and control-flow analysis. The recent development of pushdown control-flow analysis for the λ-calculus hints at a way to improve analysis of exceptions: a pushdown stack can precisely match catches to throws in the same way it matches returns to calls....
متن کاملImproved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
We present a sound static analysis technique for fighting the combinatorial explosion of parameterised Boolean equation systems (PBESs). These essentially are systems of mutually recursive fixed point equations ranging over first-order logic formulae. Our method detects parameters that are not live by analysing a control flow graph of a PBES, and it subsequently eliminates such parameters. We s...
متن کاملLiveness Analysis for Parameterised Boolean Equation Systems
We present a sound static analysis technique for fighting the combinatorial explosion of parameterised Boolean equation systems (PBESs). These essentially are systems of mutually recursive fixed point equations ranging over first-order logic formulae. Our method detects parameters that are not live by analysing a control flow graph of a PBES, and it subsequently eliminates such parameters. We s...
متن کامل